An Efficient Algorithm to Mine Online Data Streams
نویسندگان
چکیده
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent closed itemsets, but they are mainly intended for traditional transaction databases and thus do not take data stream characteristics into consideration. In this paper, we propose a novel approach for mining closed frequent itemsets over data streams. It computes and maintains closed itemsets online and incrementally and can output the current closed frequent itemsets in real time based on users’ specified thresholds. Experimental results show that our proposed method is both time and space efficient, has good scalability as the number of transactions processed increases and adapts very rapidly to the change in data streams.
منابع مشابه
Single-Pass Algorithms for Mining Frequency Change Patterns with Limited Space in Evolving Append-Only and Dynamic Transaction Data Streams
In this paper, we propose an online single-pass algorithm MFC-append (Mining Frequency Change patterns in append-only data streams) for online mining frequent frequency change items in continuous append-only data streams. An online space-efficient data structure called ChangeSketch is developed for providing fast response time to compute dynamic frequency changes between data streams. A modifie...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملAn Efficient Incremental Algorithm to Mine Closed Frequent Itemsets over Data Streams
The purpose of this work is to mine closed frequent itemsets from transactional data streams using a sliding window model. An efficient algorithm IMCFI is proposed for Incremental Mining of Closed Frequent Itemsets from a transactional data stream. The proposed algorithm IMCFI uses a data structure called INdexed Tree(INT) similar to NewCET used in NewMoment[5]. INT contains an index table Item...
متن کاملAn Approximate Scheme to Mine Frequent Patterns over Data Streams
In this paper, we propose a scheme to mine frequent patterns from data streams. Our scheme can guarantee to run mining algorithm in the limited memory capacity when the data becomes large enough, and to keep the running time at the regular range when the time evolves. We emphasize the most recent data but do not discard all of the historical data. We propose efficient sampling and merging schem...
متن کاملMining Maximum Frequent Item Sets Over Data Streams Using Transaction Sliding Window Techniques
As we know that the online mining of streaming data is one of the most important issues in data mining. In this paper, we proposed an efficient one.frequent item sets over a transaction-sensitive sliding window), to mine the set of all frequent item sets in data streams with a transaction-sensitive sliding window. An effective bit-sequence representation of items is used in the proposed algorit...
متن کامل